package com.example.leetcode.matrix;

import com.example.leetcode.matrix.common.MatrixUtils;

class Solution6343 {
    public int minimumCost(int[] start, int[] target, int[][] specialRoads) {
        return MatrixUtils.minimumCost(start, target, specialRoads);
    }
}

public class leetcode6343 {
    public static void main(String[] args) {
        int[] start = {1, 1};
        int[] target = {4, 5};
        int[][] specialRoads = {{1, 2, 3, 3, 2}, {3, 4, 4, 5, 1}};
        Solution6343 solution6343 = new Solution6343();
        System.out.println(solution6343.minimumCost(start, target, specialRoads));
    }
}
